Extracting Alternative Machining Features: An Algorithmic Approach

نویسندگان

  • William C. Regli
  • Satyandra K. Gupta
  • Dana S. Nau
چکیده

Automated recognition of features from CAD models has been attempted for a wide range of application domains. In this paper we address the problem of representing and recognizing a complete class of features in alternative interpretations for a given design. We present a methodology for recognizing a class of machinable features and addressing the computational problems posed by the existence of feature-based alternatives. Our approach addresses a class of volumetric features that describe material removal volumes made by operations on 3-axis vertical machining centers including: drilling, pocket-milling, slot-milling, face-milling, chamfering, lleting, and blended surfaces. This approach recognizes intersecting features and is complete over all features in our class; i.e., for any given part, the algorithm produces a set containing all features in our class that correspond to possible operations for machining that part. This property is of particular significance in applications where consideration of di erent manufacturing alternatives is crucial. This approach employs a class of machinable features expressible as MRSEVs (a STEP-based library of machining features). An example of this methodology has been implemented using the ACIS solid modeler and the National Institutes of Health C++ class library. Current address: National Institute of Standards and Technology, Center for Manufacturing Engineering, Manufacturing Systems Integration Division, Building 220, Room A-127, Gaithersburg, MD 20899. Current address: Rapid Manufacturing Laboratory, The Robotics Institute, Carnegie Mellon University, Pittsburgh, PA 15213

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extracting Alternative Machining Features : Al Algorithmic Approach

Automated recognition of features from CAD models has been attempted for a wide range of application domains. In this paper we address the problem of representing and recognizing the complete class of features in alternative interpretations for a given design. We present a methodology for recognizing a class of machinable features and addressing the computational problems posed by the existence...

متن کامل

Generating Alternative Interpretations of Machining Features

One of the major difficulties in extracting machining features is the lack of a systematic methodology to generate alternative ways of manufacturing a machined part. Most of the early research in feature extraction and process planning has not considered this aspect, and has focused on the generation of a single interpretation. In this paper, we propose a featurebased approach to generating alt...

متن کامل

RECOGNITION FOR MANUFACTURABILITY ANALYSISWilliam

While automated recognition of features has been attempted for a wide range of applications, no single existing approach possesses the functionality required to perform manufacturability analysis. In this paper, we present a methodology for taking a CAD model of a part and extracting a set of machinable features that contains the complete set of alternative interpretations of the part as collec...

متن کامل

Feature Recognition for Manufacturability Analysis

While automated recognition of features has been at tempted for a wide range of applications no single exist ing approach possesses the functionality required to per form manufacturability analysis In this paper we present a methodology for taking a CAD model of a part and ex tracting a set of machinable features that contains the com plete set of alternative interpretations of the part as coll...

متن کامل

A dynamic programming approach for solving nonlinear knapsack problems

Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995